package Demo01;

import java.util.HashSet;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        //数组长度
        int l = scanner.nextInt();
        int[] arr = new int[l];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = scanner.nextInt();
        }
        HashSet<Integer> set = new HashSet<>();
        //set清零后要将reSet数据倒进去
        HashSet<Integer> reSet = new HashSet<>();
        for (int i = 0; i < arr.length; i++) {
            set.add(arr[i]);
            reSet.add(arr[i]);
        }
        //set存放不同的数
        //再申请一个数组存放最短, minl进行计数,  比较
        for (int i = 0; i < arr.length; i++) {

        }
    }
}
